A Refined Algorithm for the etaT Pairing Calculation in Characteristic Three
نویسندگان
چکیده
We describe further improvements of the ηT pairing algorithm in characteristic three. Our approach combines the loop unrolling technique introduced by Granger et. al for the Duursma-Lee algorithm, and a novel algorithm for multiplication over F36m proposed by Gorla et al. at SAC 2007. For m = 97, the refined algorithm reduces the number of multiplications over F3m from 815 to 692.
منابع مشابه
A Fast Implementation of etaT Pairing in Characteristic Three on Intel Core 2 Duo Processor
We present an efficient implementation of ηT pairing on Intel Core 2 Duo processor. The processing speed of our implementation achieves 92 μsec over F 3 and 553 μsec over F 3 on 2.6GHz processor.
متن کاملEfficient Hardware for the Tate Pairing Calculation in Characteristic Three
In this paper the benefits of implementation of the Tate pairing computation in dedicated hardware are discussed. The main observation lies in the fact that arithmetic architectures in the extension field GF (3) are good candidates for parallelization, leading to a similar calculation time in hardware as for operations over the base field GF (3). Using this approach an architecture for the hard...
متن کاملAn Algorithm for the ηT Pairing Calculation in Characteristic Three and its Hardware Implementation
In this paper, we propose a modified ηT pairing algorithm in characteristic three which does not need any cube root extraction. We also discuss its implementation on a low cost platform which hosts an Altera Cyclone II FPGA device. Our pairing accelerator is ten times faster than previous known FPGA implementations in characteristic three.
متن کاملAlgorithms and Arithmetic Operators for Computing the etaT Pairing in Characteristic Three
Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we discuss several algorithms to compute the ηT pairing in characteristic three and suggest further impr...
متن کاملProviding A New Characteristic for Overcurrent Relays
This with the integration of distributed generation (DG) to meshed distribution systems, the operating time of the protective system becomes a major concern in order to avoid nuisance DG tripping. This paper proposes a new tripping characteristic for directional overcurrent relays (DOCRs) that can achieve a higher possible reduction of overall relays operating time in meshed distribution networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2007 شماره
صفحات -
تاریخ انتشار 2007